P4-KBR: A Key-Based Routing System for P4-Programmable Networks

نویسندگان

چکیده

Software-defined networking (SDN) architecture has provided well-known advantages in terms of network programmability, initially offering a standard, open, and vendor-agnostic interface (e.g., OpenFlow) to instruct the forwarding behavior devices from different vendors. However, last few years, data plane programmability emerged as promising approach extend management allowing definition programming customized non-standardized protocols, well specific packet processing pipelines. In this paper, we propose an in-network key-based routing protocol called P4-KBR, which end-points (hosts, contents or services) are identified by virtual identifiers (keys) instead IP addresses, where P4 elements programmed be able route packets adequately. The proposal was implemented evaluated using bmv2 switches, verifying how offers powerful tool overcome continuing challenges that appear SDN networks.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Linear-time Recognition Algorithm for P4- a Unique Tree Representation for P4-sparse

7)) algorithm for the 3-clique-width problem. Preprint, 1998. Sha98] A. Sharell. Complexit e Descriptive et l'approximation des fonctions de d enombrement. J. Makowsky and U. Rotics. On the cliquewidth of graphs with few P4's. Linear time solvable optimization problems on certain structured graph families, extended abstract. Cou99] B. Courcelle. The monadic second order logic of graphs, XIV: un...

متن کامل

Extremal P4-stable graphs

Call a graph G k-stable (with respect to some graph H) if, deleting any k edges of G, the remaining graph still contains H as a subgraph. For a fixed H, the minimum number of edges in a k-stable graph is denoted by S(k). We prove general bounds on S(k) and compute the exact value of the function S(k) for H = P4. The main result can be applied to extremal k-edge-hamiltonian hypergraphs.

متن کامل

Laplacian integrality in P4-sparse and P4-extendible graphs

Let G be a simple graph and L = L(G) the Laplacian matrix of G. G is called L-integral if all its Laplacian eigenvalues are integer numbers. It is known that every cograph, a graph free of P4, is L-integral. The class of P4-sparse graphs and the class of P4-extendible graphs contain the cographs. It seems natural to investigate if the graphs in these classes are still L-integral. In this paper ...

متن کامل

Magnetic HUB - P4 Reflection

Project Description The project is located in the twin cities El Paso and Cd Juarez within the border area of United Stated and Mexico. During the field trip, we were about to find out the existing problems on site and try to put forward feasible architectural solutions. After the research and on site visit, it is easily found that Cd Juarez is suffering from the imbalance economic development ...

متن کامل

On P4-tidy graphs

We study the P4-tidy graphs, a new class defined by Rusu [30] in order to illustrate the notion of P4-domination in perfect graphs. This class strictly contains the P4-extendible graphs and the P4-lite graphs defined by Jamison & Olariu in [19] and [23] and we show that the P4-tidy graphs and P4-lite graphs are closely related. Note that the class of P4-lite graphs is a class of brittle graphs ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2021

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics10131543